Long cycles in locally expanding graphs, with applications

نویسنده

  • Michael Krivelevich
چکیده

We provide sufficient conditions for the existence of long cycles in locally expanding graphs, and present applications of our conditions and techniques to Ramsey theory, random graphs and positional games.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0n removable cycles in graphs and digraphs

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

متن کامل

Vertex Removable Cycles of Graphs and Digraphs

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if $F$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$G in F $‎, ‎the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $.‎ ‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎    

متن کامل

Finding and using expanders in locally sparse graphs

We show that every locally sparse graph contains a linearly sized expanding subgraph. For constants c1 > c2 > 1, 0 < α < 1, a graph G on n vertices is called a (c1, c2, α)-graph if it has at least c1n edges, but every vertex subset W ⊂ V (G) of size |W | ≤ αn spans less than c2|W | edges. We prove that every (c1, c2, α)-graph with bounded degrees contains an induced expander on linearly many ve...

متن کامل

Some New Analytical Techniques for Duffing Oscillator with Very Strong Nonlinearity

The current paper focuses on some analytical techniques to solve the non-linear Duffing oscillator with large nonlinearity. Four different methods have been applied for solution of the equation of motion; the variational iteration method, He’s parameter expanding method, parameterized perturbation method, and the homotopy perturbation method. The results reveal that approxim...

متن کامل

A sufficient condition for Hamiltonicity in locally finite graphs

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017